Specifying Constraint Problems with Z
نویسندگان
چکیده
In this paper, we present a novel use of the formal specification language Z for the construction of constraint problem models. These models can then be refined into constraint programs. Z’s expressiveness and suitability is proven by contrasting Z with three existing abstract constraint languages and by, successfully and efficiently, specifying numerous constraint and optimisation benchmark problems in Z. These specifications have been published in an online library, which also contains three toolkits which support the specification of a variety of problem types.
منابع مشابه
A firefly algorithm for solving competitive location-design problem: a case study
This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new chain stores in the city of Tehran, Iran, is used and the results are analyzed. In addition, several...
متن کاملCoping With Disjunctions in Temporal Constraint Satisfaction Problems
Path-consistency algorithms, which are polynomial for discrete problems, are exponential when applied to problems involving quantitative temporal information. The source of complexity stems from specifying relationships between pairs of time points as disjunction of intervals. We propose a polynomial algorithm, called ULT, that approximates path-consistency in Temporal Constraint Satisfaction P...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملit in Temporal Constraint
Path-consistency algorithms, which are polynomial for discrete problems, are exponential when applied to problems involving quantitative temporal information. The source of complexity stems from specifying relationships between pairs of time points as disjunction of intervals. We propose a polynomial algorithm, called ULT, that approximates path-consistency in Temporal Constraint Satisfaction P...
متن کاملTurtle: A Constraint Imperative Programming Language
Ideally, in constraint programs, the solutions of problems are obtained by specifying their desired properties, whereas in imperative programs, the steps which lead to a solution must be defined explicitly, rather than being derived automatically. This paper deals with the design and implementation of the programming language Turtle, which integrates declarative constraints and imperative langu...
متن کامل